A Short Survey of Aproximation Algorithms for Combinatorial Optimization under Uncertainty∗
نویسنده
چکیده
This paper briefly describes three well-established frameworks for handling uncertainty in optimization problems. Our focus is mainly on combinatorial optimization and on the development of approximation algorithms under the discussed frameworks. In particular, we give a brief overview of Stochastic Programming, Robust Optimization, and Probabilistic Combinatorial Optimization, and list approximation results from the wealth of recent literature on combinatorial problems under these disciplines.
منابع مشابه
Metaheuristics in Stochastic Combinatorial Optimization: a Survey
Metaheuristics such as Ant Colony Optimization, Evolutionary Computation, Simulated Annealing, Tabu Search and Stochastic Partitioning Methods are introduced, and their recent applications to a wide class of combinatorial optimization problems under uncertainty are reviewed. The flexibility of metaheuristics in being adapted to different modeling approaches and problem formulations emerges clea...
متن کاملRobustness-based portfolio optimization under epistemic uncertainty
In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...
متن کاملMulti-Objective Optimization for Multi-Product Multi-Period Four Echelon Supply Chain Problems Under Uncertainty
The multi-objective optimization for a multi-product multi-period four-echelon supply chain network consisting of manufacturing plants, distribution centers (DCs) and retailers each with uncertain services and uncertain customer nodes are aimed in this paper. The two objectives are minimization of the total supply chain cost and maximization of the average number of products dispatched to custo...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA Bi-objective Stochastic Optimization Model for Humanitarian Relief Chain by Using Evolutionary Algorithms
Due to the increasing amount of natural disasters such as earthquakes and floods and unnatural disasters such as war and terrorist attacks, Humanitarian Relief Chain (HRC) is taken into consideration of most countries. Besides, this paper aims to contribute humanitarian relief chains under uncertainty. In this paper, we address a humanitarian logistics network design problem including local dis...
متن کامل